Cluster Deletion on Interval Graphs and Split Related Graphs
نویسندگان
چکیده
منابع مشابه
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of spl...
متن کاملComponent Coloring of Proper Interval Graphs and Split Graphs
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of component coloring of graphs. Given a graph, the problem is to color the vertices using the minimum number of colors so that the size of each connected component of the subgraph induced by the vertices of the same color does not exceed C. We give a linear time algorithm for the problem ...
متن کاملInterval graphs and related topics
Interval graphs have engaged the interest of researchers for over twenty-five years. The scope of current research in this area now extends to the mathematical and algorithmic properties of interval graphs, their generalizations, and graph parameters motivated by them. One main reason for this increasing interest is that many real-world applications involve solving problems on graphs which are ...
متن کاملOptimal distance labeling for interval graphs and related graphs families∗
A distance labeling scheme is a distributed graph representation that assigns labels to the vertices and enables to answer distance queries between any pair (x, y) of vertices by using only the labels of x and y. This paper presents an optimal distance labeling scheme with labels of O(log n) bits for the n-vertex interval graphs family. It improves by log n factor the best known upper bound of ...
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2021
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-021-00817-8